#include <iostream>
#include <stdio.h>
#include <cmath>
#include <vector>
#include <set>
using namespace std;
typedef long long ll;
struct node {
	ll x,y;
};
struct xian{
	ll a, b, z;
	bool operator ==(const xian& zz) const {
		return a==zz.a&&b==zz.b&&z==zz.z ;
	}
	bool operator < (const xian& zz) const {
		if (a<zz.a) return true;
		if (a==zz.a) {
			if (b<zz.b) return true;
			if (b==zz.b) return z<zz.z;
			return false;
		}
		return false;
	}
};
node a[100005];
xian tmp;
bool Online(node a, node b, node c) {
	return (a.x-b.x)*(b.y-c.y)-(b.x-c.x)*(a.y-b.y)==0;
}
int main() {
	freopen("in.txt", "r", stdin);
	ll n;
	while (cin>>n) {
		set<xian> Line;
		for (ll i=0; i<n; ++i) {
			cin>>a[i].x>>a[i].y;
		}
		vector<node> LineSet;
		LineSet.push_back(a[0]); LineSet.push_back(a[1]);
		bool flag=true;
		int st=2;
		for (; Online(a[0], a[1], a[st])&&st<n; ++st);
		if (st<n) LineSet.push_back(a[st]);
		if (st<n&&st>2) {
			tmp.a=a[0].y-a[1].y;
			tmp.b=-(a[0].x-a[1].x);
			tmp.z=a[0].x*a[1].y-a[1].x*a[0].y;
			Line.insert(tmp);
		}
		while (st<n) {
			bool zz=false;
			for (int i=0; i<3; ++i) {
				for (int j=0; j<3; ++j) {
					if (i!=j) {
						if (Online(LineSet[i], LineSet[j], a[st])) {
							zz=true;
						}
					}
				}
			}
			if (zz==false) {
				LineSet.push_back(a[st]);
				break;
			}
			++st;
		}
		while (st<n) {
			bool zz=false;
			for (int i=0; i<4; ++i) {
				for (int j=i+1; j<4; ++j) {
					if (i!=j) {
						if (Online(LineSet[i], LineSet[j], a[st])) {
							zz=true;
							tmp.a=a[i].y-a[j].y;
							tmp.b=-(a[i].x-a[j].x);
							tmp.z=a[i].x*a[j].y-a[j].x*a[i].y;
							if (tmp.a<0) {
								tmp.a=-tmp.a;
								tmp.b=-tmp.b;
								tmp.z=-tmp.z;
							}
							Line.insert(tmp);
							printf("%lld %lld %lld\n", tmp.a, tmp.b, tmp.z);
						}
					}
				}
			}
			if (zz==false) {
				flag=false;
				cout<<"here: "<<flag<<endl;
				break;
			}
			++st;
		}
		cout<<Line.size()<<endl;
		if (Line.size()>2) flag=false;
		if (!flag) cout<<"failure"<<endl;
		else cout<<"success"<<endl;
	}
	return 0;
}
